import java.util.*;

public class test2 {
    public static void main(String[] args) {
        List<int[]> t = new ArrayList<>();
        t.add(new int[]{1,2});
        t.get(0)[0] += 1;
        System.out.println(t.get(0)[0]);
    }
    static void solve5(){
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        in.nextLine();
        int[] a = new int[n];
        for(int i=0; i<n; i++){
            a[i] = in.nextInt();
        }
        int[] f = new int[n];//以i结尾的最长递减子序列
        int[] g = new int[n];//以i开头的最长递增子序列
        f[0] = g[n-1] = 1;
        for(int i=1; i<n; i++){
            f[i] = 1;
            for(int j=0; j<i; j++){
                if(a[i] < a[j])
                    f[i] = Math.max(f[i], f[j] + 1);
            }
        }
        for(int i=n-2; i>=0; i--){
            g[i] = 1;
            for(int j=n-1; j>i; j--){
                if(a[i] < a[j])
                    g[i] = Math.max(g[i], g[j] + 1);
            }
        }
        int ans = 0;
        for(int i=1; i<n-1; i++){
            ans = Math.max(ans, f[i] + g[i] - 1);
        }
        System.out.println(ans);
    }
    static void solve4(){
        int[] a = new int[]{2, 1, 4, 7, 4, 8, 3, 6, 4, 7};
        //1 2 1 1 2 1 3 2 3
        int n = a.length;
        int[] f = new int[n];//以i结尾的最长递减子序列
        int[] g = new int[n];//以i开头的最长递增子序列
        f[0] = g[n-1] = 1;
        for(int i=1; i<n; i++){
            f[i] = 1;
            for(int j=0; j<i; j++){
                if(a[i] < a[j])
                    f[i] = Math.max(f[i], f[j] + 1);
            }
        }
        for(int i=n-2; i>=0; i--){
            g[i] = 1;
            for(int j=n-1; j>i; j--){
                if(a[i] < a[j])
                    g[i] = Math.max(g[i], g[j] + 1);
            }
        }
        System.out.println(Arrays.toString(f));
        System.out.println(Arrays.toString(g));
        int ans = 0;
        for(int i=1; i<n-1; i++){
            ans = Math.max(ans, f[i] + g[i] - 1);
        }
        System.out.println(ans);
    }
    static void solve3(){
        int[] a = new int[]{2,1,4, 7, 4, 8, 3, 6, 4, 7};
        int n = a.length;
        int k = 2;
        long ans = 0;
        long[] s = new long[2];
        for(int l=0,r=0; r<n; r++){
            s[r%2] += a[r];
            if(r-l+1 > 2*k-1){
                s[l%2] -= a[l];
                l++;
            }
            System.out.println(l+" "+s[r%2]);
            ans = Math.max(ans, s[r%2]);
        }
        System.out.println(ans);
    }
    static void solve2(){
//        int n = 2024;
//        int ans = n/15*2;
//        System.out.println(ans);
        String[] s = "2024-1949".split("-");
        long a = Long.parseLong(s[0]);
        long b = Long.parseLong(s[1]);
        System.out.println(a - b);
    }
    static void solve1(){
        int[] arr = new int[]{9226, 4690, 4873, 1285, 4624, 1596, 6982,
                590, 8806, 121, 8399, 8526, 5426, 64, 9655, 7705, 3929,
                3588, 7397, 8020, 1311, 5676, 3469, 2325, 1226, 8203,
                9524, 3648, 5278, 8647};
        long ans = 0;
        for(int i=0; i<10; i++){
            for(int x : arr) {
                ans += (long) (i ^ x) * (i ^ x);
            }
            System.out.println(ans);
        }
    }
    static void solve() {
        long cnt = 0;
        int s = 7;
        int[] months = new int[]{31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
        int j = 1;
        for (int x : months) {
            System.out.println(j + "月" + ":" + x);
            j++;
        }
        for (int i = 1901; i <= 2024; i++) {
            if (i % 400 == 0 || i % 4 == 0 && i % 100 != 0) {
                months[1] = 29;
            } else {
                months[1] = 28;
            }
            //7号星期一
            //1 11 21 31
            //
            for (int x : months) {
                while (s <= x) {
                    if (s == 1 || s == 11 || s == 21 || s == 31) {
                        cnt++;
                    }
                    s += 7;
                }
                s -= x;
            }
        }
        System.out.println(cnt);
    }
}
